An Algorithm to Generate Probabilities with Specified Entropy
نویسندگان
چکیده
منابع مشابه
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as input. We first recall some useful results, namely the distributive lattice structure of the space of tilings and Thurston’s algorithm for constructing a particular tiling. We then describe our algorithm and study its...
متن کاملUsing Semantics Specified in Maude to Generate Test Cases
Testing is one of the most important and most time-consuming tasks in the software developing process and thus techniques and systems to generate and check test cases have become crucial. For these reasons, when specifying a prototype of a programming language it may be very useful to have a tool that, beyond testing the semantics of the program, generates test cases for the programs written in...
متن کاملInference with Seperately Specified Sets of Probabilities in Credal Networks
We present new algorithms for inference in credal networksdirected acyclic graphs asso ciated with sets of probabilities. Credal networks are here interpreted as encoding strong indepen dence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this set ting. We th...
متن کاملPartially-specified probabilities: decisions and games
The paper develops a theory of decision making based on partially-specified probabilities. It takes an axiomatic approach using Anscombe-Aumann’s setting, and is based on the concave integral for capacities. This theory is then expanded to interactive models in order to extend Nash equilibrium by introducing the concept of partially-specified equilibrium.
متن کاملAn Algorithm to Generate Canonical Transformations: Application to Normal Forms
We describe a new method to generate symplectic diieomorphisms. This method is based on primitive functions, and it was introduced in 24]. We apply the algorithm to the construction of normal forms of KAM tori. A concrete application, developed in detail and implemented numerically, is normal forms near invariant circles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2015
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2015.612174